Hamiltonian powers in threshold and arborescent comparability graphs

We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give efficient algorithms as well as sufficient and minimax toughness like conditions. For arborescent comparability graphs we have similar results but also show that for one type of completion problem an ‘obvious’ minimax condition fails. For cographs we give examples showing that toughness and other ‘obvious’ necessary conditions are not sufficient. For threshold graphs we give additional necessary and sufficient conditions in terms of vertex degrees as well as a minimax formula for the length of a longest cycle power.